An Approach to Compositional Model Checking
نویسندگان
چکیده
A natural trend in most of the engineering disciplines is the construction of systems from components. This has the potential to reduce costs and increase reliability, provided that the components can be specified and verified in such a way that it is possible to reason about the composed system. In this paper, we explore an approach to compositional reasoning that uses model checking to verify component specifications and deduction to verify the constraints that a component imposes on the system in which it is embedded. We use CTL as the specification language along with the SMV model checker.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملCompositional model checking of monadic least fixed point logic
Compositional model checking refers to reducing the problem of model checking some property of the whole system to the problem of model checking its components. In this paper, we investigate compositional approach for model checking monadic least fixed point logic on transition systems assembled from the components by using the H-sum and the fusion operator. 1 Research Area – Main Themes The ma...
متن کاملTowards Compositional Approach for Parametric Model Checking in Software Product Lines
Parametric model-checking allows the use of a single model to obtain properties values from different configurations through an arithmetic formula. Formulas with hundreds of operands and operators can be evaluated at runtime in milliseconds on current computers. Neverthless, those formulas may not scale to devices with limited resources. This work-in-progress addresses this problem by presentin...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAbstraction and Assume-guarantee Reasoning for Automated Software Verification
ion and Assume-guarantee Reasoning for Automated Software Verification S. Chaki, E. Clarke, D. Giannakopoulou, and C.S. Păsăreanu 1 Carnegie Mellon Software Engineering Institute 2 Carnegie Mellon University 3 RIACS, NASA Ames Research Center, Moffett Field, CA, USA 4 Kestrel Technology LLC, NASA Ames Research Center, Moffett Field, CA, USA Abstract. Compositional verification and abstraction a...
متن کاملTowards the Incremental Model Checking of Complex Real-Time UML Models
Today, the verification of complex distributed embedded real-time systems employing model checking is largely limited by the state explosion problem. We first report on the current tool support for an approach which addresses this problem by means of a compositional model checking approach for a pattern and component based UML 2.0 designs. However, the current checking covers only an abstractio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002